#include <bits/stdc++.h>
#include <queue>
using namespace std;

#define int int64_t
#define endl "\n"

using PII = pair<int, int>;
using TII = tuple<int, int, int>;
template<class T> using V = vector<T>;
using i64 = long long;
using i128 = __int128;
using u64 = unsigned long long;

#define FOR(i, a, b) for (int i = (int)(a); i <= (int)(b); i++)
#define FOR2(i, a, b, c) for (int i = (int)(a); i <= (int)(b); i += c)
#define FORD(i, b, a) for (int i = (int)(a); i >= (int)(b); i--)
#define FORD2(i, b, a, c) for (int i = (int)(a); i >= (int)(b); i -= c)
#define ALL(a) a.begin(), a.end()
#define RALL(a) a.rbegin(), a.rend()
#define lowbit(x) ((x) & (-x))
#define RE return;
#define Yes cout << "Yes" << endl;
#define YES cout << "YES" << endl;
#define No cout << "No" << endl;
#define NO cout << "NO" << endl;
#define pb push_back
#define eb emplace_back
#define fi first
#define se second
#define sz(x) (int)(x).size()

void solve() {
    int n, k;
    cin >> n >> k;

    int ans = 0;

    V<int> pre(n + 1, 0), w(n + 1, 0);

    FOR(i, 1, n) cin >> w[i];

    FOR(a, 0, n) {
        FOR(b, a + 1, n + 1) {
            int t = a + (n - b + 1);
            if (t <= k) {
                priority_queue<int, V<int>, greater<int>> q;
                FOR(i, 1, a) {
                    q.push(w[i]);
                }
                FOR(i, b, n) q.push(w[i]);
                int p = k - t;
                while (sz(q) && p) {
                    p--;
                    if (q.top() < 0)
                        q.pop();
                    else
                        break;
                }
                int tt = 0;
                while (sz(q)) {
                    tt += q.top();
                    q.pop();
                }
                // cout << a << ' ' << b << ' ' << tt << endl;
                ans = max(ans, tt);
            }
        }
    }

    cout << ans;
}

signed main() {
    int Task = 1;

    ios::sync_with_stdio(false);
    cin.tie(nullptr);

    while (Task--) {
        solve();
    }

    return 0;
}